Search results for "Rank of an abelian group"

Hyper-abelian groups with finite co-central rank

2004

AbstractA group G has finite co-central rank s if there exists a least non-negative integer s such that every finitely generated subgroup H can be generated by at most s elements modulo the centre of H. The investigation of such groups has been started in [J.P. Sysak, A. Tresch, J. Group Theory 4 (2001) 325]. It is proved that hyper-abelian groups with finite co-central rank are locally soluble. The interplay between the Prüfer rank condition, the condition of having finite abelian section rank and the finite co-central rank condition is studied. As one result, a hyper-abelian group G with finite co-central rank has an ascending series with abelian factors of finite rank and every chief fac…

On 2-groups with no abelian subgroups of rank four

1975

Extension of a Schur theorem to groups with a central factor with a bounded section rank

2013

Abstract A well-known result reported by Schur states that the derived subgroup of a group is finite provided its central factor is finite. Here we show that if the p-section rank of the central factor of a locally generalized radical group is bounded, then so is the p-section rank of its derived subgroup. We also give an explicit expression for this bound.

Abelian gradings on upper-triangular matrices

2003

Let G be an arbitrary finite abelian group. We describe all possible G-gradings on an upper-triangular matrix algebra over an algebraically closed field of characteristic zero.

Algorithms for Computing Abelian Periods of Words

2012

Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the notion of an \emph{Abelian period} of a word. A word of length $n$ over an alphabet of size $\sigma$ can have $\Theta(n^{2})$ distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time $O(n^2 \times \sigma)$ using $O(n \times \sigma)$ space. We present an off-line algorithm based on a $\sel$ function having the same worst-case theoretical complexity as the Brute-Force one, but outperforming it in practice. We then present on-line algorithms that also enable to compute all the Abelian periods of all the prefixes of $w$.

A note on easy and efficient computation of full abelian periods of a word

2016

Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement $O(n\log\log n)$-time algorithm for computing all the full Abelian periods of a word of length $n$ over a constant-size alphabet. Experiments show that our algorithm significantly outperforms the $O(n)$ algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the same problem.

Fast computation of abelian runs

2016

Given a word $w$ and a Parikh vector $\mathcal{P}$, an abelian run of period $\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having abelian period $\mathcal{P}$. Our main result is an online algorithm that, given a word $w$ of length $n$ over an alphabet of cardinality $\sigma$ and a Parikh vector $\mathcal{P}$, returns all the abelian runs of period $\mathcal{P}$ in $w$ in time $O(n)$ and space $O(\sigma+p)$, where $p$ is the norm of $\mathcal{P}$, i.e., the sum of its components. We also present an online algorithm that computes all the abelian runs with periods of norm $p$ in $w$ in time $O(np)$, for any given norm $p$. Finally, we give an $O(n^2)$-time offline randomi…

$MC$-hypercentral groups

2007

This paper is devoted to the imposition of some chain conditions on groups having a generalized central series. It is also given a characterization of MC-groups with finite abelian section rank: such class of groups is a suitable enlargement of the class of FC-groups. Mathematics Subject Classification: 20F24; 20F14